Lecture 6 : Bounded Model Checking
نویسنده
چکیده
In this class we cover the area of Model Checking: checking weather a given model satisfies an interesting, predefined property. We will specifically focus on the problem of Bounded Model Checking, where the model is bounded in size, and its relation to software verification problems. We will then describe a specific implementation of a Bounded Model Checker CBMC, which implements BMC over the C programming language, and discuss the challenges of implementing such a program and the solutions used by the CBMC authors to solve them.
منابع مشابه
Lecture Notes on Software Model Checking
So far we’ve focused on model checking algorithms that assume a computation structure is given. It should come as no surprise that our goal is to perform model checking of programs given as code, so today we’ll describe techniques that allow us to apply model checking in this setting. There are several challenges to doing so, foremost among them the fact that the statespace of programs may be i...
متن کاملFriendly Logics , Fall 2015 , Lecture Notes
Since we already know (Theorem 1.3 in lecture notes 3) that the data complexity of FOL model checking is in LOGSPACE, we could use common complexity-theoretic assumptions (such as LOGSPACE 6=NP) to conclude that NP-complete properties of finite graphs such as Hamiltonicity, clique or independent set existence, etc. are not FO-definable. However, we might be interested in asking if properties th...
متن کاملModel Checking and the State Explosion Problem
Model checking is an automatic verification technique for hardware and software systems that are finite state or have finite state abstractions. It has been used successfully to verify computer hardware, and it is beginning to be used to verify computer software as well. As the number of state variables in the system increases, the size of the system state space grows exponentially. This is cal...
متن کاملBounded Semantics of CTL and SAT-Based Verification
Bounded model checking has been proposed as a complementary approach to BDD based symbolic model checking for combating the state explosion problem, esp. for efficient error detection [3]. This has led to a lot of successful work with respect to error detection in the checking of LTL, ACTL (the universal fragment of CTL) and ACTL* properties by satisfiability testing [3, 22, 25]. The use of bou...
متن کاملA Logic of Situated Resource-Bounded Agents
We propose a framework for modelling situated resource-bounded agents. The framework is based on an objective ascription of intentional modalities and can be easily tailored to the system we want to model and the properties we wish to specify. As an elaboration of the framework, we introduce a logic, OBA, for describing the observations, beliefs, intentions and actions of simple agents, and sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015